Depuis les années 2000, l’histoire des émotions, champ de recherche particulièrement fécond, tente de renouer des liens entre l’histoire et la psychologie, dont le divorce semblait jusque-là prononcé. Les émotions, longtemps considérées comme fugaces, irrationnelles, voire incommunicables, semblent à présent susceptibles d’être étudiées par l’historien. Aussi bien dans ses méthodes que dans les processus de légitimation auquel elle se confronte, elle entretient des liens étroits avec l’histoire des idées, qu’elle recoupe en partie. Cet article propose de dégager quelques enjeux épistémologiques (...) et méthodologiques communs à ces deux champs historiographiques. (shrink)

In their logical analysis of theorems about disjoint rays in graphs, Barnes, Shore, and the author (hereafter BGS) introduced a weak choice scheme in second-order arithmetic, called the $\Sigma ^1_1$ axiom of finite choice (hereafter finite choice). This is a special case of the $\Sigma ^1_1$ axiom of choice ( $\Sigma ^1_1\text {-}\mathsf {AC}_0$ ) introduced by Kreisel. BGS showed that $\Sigma ^1_1\text {-}\mathsf {AC}_0$ suffices for proving many of the aforementioned theorems in graph theory. While it is not known (...) if these implications reverse, BGS also showed that those theorems imply finite choice (in some cases, with additional induction assumptions). This motivated us to study the proof-theoretic strength of finite choice. Using a variant of Steel forcing with tagged trees, we show that finite choice is not provable from the $\Delta ^1_1$ -comprehension scheme (even over $\omega $ -models). We also show that finite choice is a consequence of the arithmetic Bolzano–Weierstrass theorem (introduced by Friedman and studied by Conidis), assuming $\Sigma ^1_1$ -induction. Our results were used by BGS to show that several theorems in graph theory cannot be proved using $\Delta ^1_1$ -comprehension. Our results also strengthen results of Conidis. (shrink)

Recall that B is PA relative to A if B computes a member of every nonempty $\Pi ^0_1(A)$ class. This two-place relation is invariant under Turing equivalence and so can be thought of as a binary relation on Turing degrees. Miller and Soskova [23] introduced the notion of a $\Pi ^0_1$ class relative to an enumeration oracle A, which they called a $\Pi ^0_1{\left \langle {A}\right \rangle }$ class. We study the induced extension of the relation B is PA relative (...) to A to enumeration oracles and hence enumeration degrees. We isolate several classes of enumeration degrees based on their behavior with respect to this relation: the PA bounded degrees, the degrees that have a universal class, the low for PA degrees, and the ${\left \langle {\text {self}\kern1pt}\right \rangle }$ -PA degrees. We study the relationship between these classes and other known classes of enumeration degrees. We also investigate a group of classes of enumeration degrees that were introduced by Kalimullin and Puzarenko [14] based on properties that are commonly studied in descriptive set theory. As part of this investigation, we give characterizations of three of their classes in terms of a special sub-collection of relativized $\Pi ^0_1$ classes—the separating classes. These three can then be seen to be direct analogues of three of our classes. We completely determine the relative position of all classes in question. (shrink)

(1974). Ideas on the composition of muriatic acid and their relevance to the oxygen theory of acidity. Annals of Science: Vol. 31, No. 3, pp. 213-225.

It is found that a coherent state of the cavity field can be generated in a micromaser with injected atoms in a coherent superposition of the upper and lower states. The dependence of the density matrix elements of the field on the number of injected atoms indicates that due to the same initial atomic coherence the emission of separately injected single atoms in the cavity is a cooperative process.